Logical Deenability on Innnite Traces
نویسنده
چکیده
The main results of the present paper are the equivalence of deenability by monadic second-order logic and recognizability for real trace languages, and that rst-order deenable, star-free, and aperiodic real trace languages form the same class of languages. This generalizes results on innnite words and on nite traces to innnite traces. It closes an important gap in the diierent characterizations of recognizable languages of innnite traces.
منابع مشابه
A Characterization of lambda Definability in Categorical Models of Implicit Polymorphism
Lambda deenability is characterized in categorical models of simply typed lambda calculus with type variables. A category-theoretic framework known as glueing or sconing is used to extend the Jung-Tiuryn characterization of lambda deenability JuT93], rst to ccc models, and then to categorical models of the calculus with type variables. Logical relations are now a well-established tool for study...
متن کاملA New Characterization of Lambda Definability
We give a new characterization of lambda deenability in Henkin models using logical relations deened over ordered sets with varying arity. The advantage of this over earlier approaches by Plotkin and Statman is its simplicity and universality. Yet, decidability of lambda deenability for hereditarily nite Henkin models remains an open problem. But if the variable set allowed in terms is also res...
متن کاملAn Expressively Complete Linear Time Temporal
A basic result concerning LT L, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the rst order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the con...
متن کاملDefinability and Commonsense Reasoning
The deenition of concepts is a central problem in commonsense reasoning. Many themes in nonmonotonic reasoning concern implicit and explicit deenability. Implicit deenability in nonmonotonic logic is always relative to the context-the current theory of the world. We show that xed point equations provide a generalization of explicit deenability, which correctly captures the relativized context. ...
متن کاملA New Characterization of Lambda De nability
We give a new characterization of lambda deenability in Henkin models using logical relations deened over ordered sets with varying arity. The advantage of this over earlier approaches by Plotkin and Statman is its simplicity and universality. Yet, decidability of lambda deenability for hereditarily nite Henkin models remains an open problem. But if the variable set allowed in terms is also res...
متن کامل